Improved probabilistic decoding of interleaved Reed–Solomon codes and folded Hermitian codes
نویسندگان
چکیده
منابع مشابه
Improved Power Decoding of Interleaved One-Point Hermitian Codes
We propose a new partial decoding algorithm for h-interleaved one-point Hermitian codes that can decode—under certain assumptions—an error of relative weight up to 1 − ( n ) h h+1 , where k is the dimension, n the length, and g the genus of the code. Simulation results for various parameters indicate that the new decoder achieves this maximal decoding radius with high probability. The algorithm...
متن کاملImproved Decoding of Interleaved AG Codes
We analyze a generalization of a recent algorithm of Bleichenbacher et al. for decoding interleaved codes on the Q-ary symmetric channel for large Q. We will show that for any m and any the new algorithms can decode up to a fraction of at least βm βm+1 (1−R−2Q−1/2m)− errors, where β = ln(qm−1) ln(qm) , and that the error probability of the decoder is upper bounded by O(1/q ), where n is the blo...
متن کاملImproved Power Decoding of One-Point Hermitian Codes
We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami–Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power decoding algorithm for Reed–Solomon codes and does not require an expensive root-finding step. In a...
متن کاملDecoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm
We prove that Alekhnovich’s algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ln log(n)) decoding algorithm for l-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent, improving in the exponent of n compared to previous results.
متن کاملLecture 10 : Folded RS Codes , Local Decoding
Definition 1. Let γ ∈ Fq be a generator of the multiplicative group of Fq, and let s ≥ 1 be an integer parameter where s divides q − 1. Then a Folded Reed Solomon code (FRS) is a code, C, with alphabet Σ = Fq, evaluation set S = {γ0.s, γ1.s, . . . , γ(((q−1)/s)−1)s}and C ⊆ Σ(q−1)/s is given by C := {(f(γ), f(γ), . . . , f(γis+s−1)) i=0 : f ∈ Fq[X], deg(f) ≤ d} example codewords: c1 = (f(γ 0), f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.10.025